Contents Stationary Queue Length Distribution for M / M / 1 / K Queue with Preemptive Priorities 6
نویسندگان
چکیده
This paper analyses a multiple class single server M/M/1/K queue with finite capacity under preemptive service priority discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. Analytical expressions for the flow balanced equations have been derived using Markov chain. This paper presents an analytical solution to the M/M/1/K queue with finite buffer under preemptive service priority and the derivation of a general expression for the steady state probabilities for any buffer K.
منابع مشابه
Analysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملA finite buffer queue with priorities
We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملJoint queue length distribution of multi-class, single-server queues with preemptive priorities
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.
متن کاملMaximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...
متن کامل